A Level-based Approach to Computing Warranted Arguments in Possibilistic Defeasible Logic Programming
نویسندگان
چکیده
Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty at object-language level. In P-DeLP, the closure of justified conclusions is not always consistent, which has been detected to be an anomaly in the context of so-called rationality postulates for rule-based argumentation systems. In this paper we present a novel level-based approach to computing warranted arguments in P-DeLP which ensures the above rationality postulate. We also show that our solution presents some advantages in comparison with the use of a transposition operator applied on strict rules.
منابع مشابه
evel-based Approach to Computing rranted Arguments in Possibilistic Defeasible Logic Programming
Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty at object-language level. In P-DeLP, the closure of justified conclusions is not always consistent, which has been detected to be an anomaly in the context of so-called rationality postulates for rule-based argumentation systems...
متن کاملComputation of skeptical outputs in P-DeLP satisfying indirect consistency: a level-based approach
Recent research has identified the notion of indirect consistency as a rationality postulate that every rule-based argumentation frameworks should satisfy. Possibilistic Defeasible Logic Programming (PDeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty at objectlanguage level, in which indirect consistency does not hold. In ...
متن کاملA characterization of collective conflict for defeasible argumentation
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among arguments. This allows us to ensure direct and indirect consistency (in the sense of Caminada and Amgoud) without distinguishing between direct and indirect conflicts. Then, the general defeasible argumentation framework is e...
متن کاملRP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
In this article, we propose a recursive semantics for warranted formulas in a general defeasible logic argumentation framework by formalizing a notion of collective (non-binary) conflict among arguments. The recursive semantics for warranted formulas is based on the intuitive grounds that if an argument is rejected, then further arguments built on top of it should also be rejected. The main cha...
متن کاملModeling Defeasible Argumentation within a Possibilistic Logic Framework with Fuzzy Unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at object-language level. This paper presents a first approach towards extending P-DeLP to incorporate fuzzy constants and fuzzy propositional variables. We focus on how to characteri...
متن کامل